#include <bits/stdc++.h>

using namespace std;
const int N=1e5+50;
int n,r[N],rem,num[N];
int main()
{
    freopen("duel.in","r",stdin);freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)cin>>r[i];
    sort(r+1,r+n+1,less<int>());
    int s=0;
    for(int i=1;i<=n;i++){
        if(r[i]!=r[i-1])s++,num[s]=1;
        if(r[i]==r[i-1])num[s]++;
    }
    for(int i=1;i<=s;i++){
        if(rem==0)rem+=num[i];
        else rem=max(rem,num[i]);
    }
    cout<<rem<<endl;
    return 0;
}
